منابع مشابه
Bipartite Graph Matchings in the Semi-streaming Model
We present an algorithm for finding a large matching in a bipartite graph in the semi-streaming model. In this model, the input graph G = (V,E) is represented as a stream of its edges in some arbitrary order, and storage of the algorithm is bounded by O(n polylogn) bits, where n = |V |. For > 0, our algorithm finds a 1 1+ -approximation of a maximum-cardinality matching and uses O “ ( 1 ) ” pas...
متن کاملMatchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n− r) blue edges for specified 0 ≤ r ≤ n, is a nontrivial integer program. We present an alternative, logically simpler proof of a theorem in [3] which establishes necessary and sufficient conditions for the existance of a solution...
متن کاملBipartite Graphs and Perfect Matchings
When we think about markets creating opportunities for interaction between buyers and sellers, there is an implicit network encoding the access between buyers and sellers. In fact, there are several ways to use networks to model buyer-seller interaction, and here we discuss some of them. First, consider the case in which not all buyers have access to all sellers. There could be several reasons ...
متن کاملRainbow matchings in bipartite multigraphs
Suppose that k is a non-negative integer and a bipartite multigraph G is the union of N = ⌊ k + 2 k + 1 n ⌋ − (k + 1) matchings M1, . . . ,MN , each of size n. We show that G has a rainbow matching of size n− k, i.e. a matching of size n− k with all edges coming from different Mi’s. Several choices of parameters relate to known results and conjectures. Suppose that a multigraph G is given with ...
متن کاملSparse PCA via Bipartite Matchings
We consider the following multi-component sparse PCA problem: given a set of data points, we seek to extract a small number of sparse components with disjoint supports that jointly capture the maximum possible variance. These components can be computed one by one, repeatedly solving the single-component problem and deflating the input data matrix, but as we show this greedy procedure is subopti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1974
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1974-0329960-9